Efficient Structured Policies for Admission Control in Heterogeneous Wireless Networks

In the near future, demand for Heterogeneous Wireless Networking (HWN) is expected to to increase. QoS provisioning in these networks is a challenging issue considering the diversity in wireless networking technologies and the existence of mobile users with different communication requirements. In HWNs with their increased complexity, “the curse of dimensionality” problem makes it impractical to directly apply the decision theoretic optimal control methods that are previously used in homogeneous wireless networks to achieve desired QoS levels. In this paper, optimal call admission control policies for HWNs are considered. A decision theoretic framework for the problem is derived by a dynamic programming formulation. We prove that for a two-tier wireless network architecture, the optimal policy has a two-dimensional threshold structure. Further, this structural result is used to design two computationally efficient algorithms, Structured Value Iteration and Structured Update Value Iteration. These algorithms can be used to determine the optimal policy in terms of thresholds. Although the first one is closer in its operation to the conventional Value Iteration algorithm, the second one has a significantly lower complexity. Extensive numerical observations suggest that, for all practical parameter sets, the algorithms always converge to the overall optimal policy. Further, the numerical results show that the proposed algorithms are efficient in terms of time-complexity and in achieving the optimal performance.